Diffusive behavior of a greedy traveling salesman
نویسندگان
چکیده
منابع مشابه
Diffusive behavior of a greedy traveling salesman.
Using Monte Carlo simulations we examine the diffusive properties of the greedy algorithm in the d-dimensional traveling salesman problem. Our results show that for d=3 and 4 the average squared distance from the origin (r(2)) is proportional to the number of steps t. In the d=2 case such a scaling is modified with some logarithmic corrections, which might suggest that d=2 is the critical dimen...
متن کامل] 2 3 M ay 2 01 1 Diffusive behavior of a greedy traveling salesman
Using Monte Carlo simulations we examine the diffusive properties of the greedy algorithm in the d-dimensional traveling salesman problem. Our results show that for d = 3 and 4 the average squared distance from the origin 〈r〉 is proportional to the number of steps t. In the d = 2 case such a scaling is modified with some logarithmic corrections, which might suggest that d = 2 is the critical di...
متن کاملDeveloping Improved Greedy Crossover to Solve Symmetric Traveling Salesman Problem
The Traveling Salesman Problem (TSP) is one of the most famous optimization problems. Greedy crossover designed by Greffenstette et al, can be used while Symmetric TSP (STSP) is resolved by Genetic Algorithm (GA). Researchers have proposed several versions of greedy crossover. Here we propose improved version of it. We compare our greedy crossover with some of recent crossovers, we use our gree...
متن کاملTolerance-based greedy algorithms for the traveling salesman problem
In this paper we introduce three greedy algorithms for the traveling salesman problem. These algorithms are unique in that they use arc tolerances, rather than arc weights, to decide whether or not to include an arc in a solution. We report extensive computational experiments on benchmark instances that clearly demonstrate that our tolerance-based algorithms outperform their weight-based counte...
متن کاملGreedy Randomized Adaptive Search Procedure for Traveling Salesman Problem
Greedy Randomized Adaptive Search Procedure for Traveling Salesman Problem. (May 2005) Seung Ho Lee, B.E., Korea University Chair of Advisory Committee: Dr. Sergiy Butenko In this thesis we use greedy randomize adaptive search procedure (GRASP) to solve the traveling salesman problem (TSP). Starting with nearest neighbor method to construct the initial TSP tour, we apply the 2-opt and the path-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2011
ISSN: 1539-3755,1550-2376
DOI: 10.1103/physreve.83.061115